Optimal prioritized channel allocation in cellular mobile systems

Under the cuto! priority discipline, the optimal prioritized channel allocation problem is formulated, which minimizes the weighted average blocking probability of hando! calls while ensuring the prespeci"ed grade of service for new calls and the co-channel interference constraints. We use the concept of pattern to deal with the problem more conveniently. Using Lagrangean relaxation and subgradient optimization techniques, we obtain high-quality solutions with information about their deviations from true optimal solutions. Computational experiments show that our method works very well.